A Streaming Data Processing Architecture Based on Lookup Tables

نویسندگان

چکیده

Processing in memory (PIM) is a new computing paradigm that stores the function values of some input modes lookup table (LUT) and retrieves their when similar are encountered (instead performing online calculations), which an effective way to save energy. In era Internet Things, processing massive data generated by front-end requires low-power real-time processing. This paper investigates energy-efficient architecture based on phase-change (PCM). replaces logical-based calculations with LUT lookups minimize power consumption operation latency. order improve efficiency lookup, RISC-V instruction set has included extended stream transmission instructions. Finally, system validated hardware simulation, performance fast Fourier transform (FFT) application evaluated. The proposed effectively improves execution reduces flow operations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterating Lookup Tables Efficiently

We show that every function f implemented as a lookup table can, by increasing the storage space by a small constant factor, be implemented such that the computational complexity of evaluating fm(x) is small independently of m and x.

متن کامل

Audio Re-Synthesis based on Waveform Lookup Tables

Transmitting speech signals at optimum quality over a weak narrowband network requires audio codecs that must not only be robust to packet loss and operate at low latency, but also offer a very low bit rate and maintain the original sound of the coded signal. Advanced speech codecs for real-time communication based on code-excited linear prediction provide bandwidths as low as 2 kbit/s. We prop...

متن کامل

Oblivious Lookup Tables

We consider the following question: given a group-homomorphic public-key encryption E, a ciphertext c = E(x, pk) hiding a value x using a key pk, and a ”suitable” description of a function f , can we evaluate E(f(x), pk) without decrypting c? We call this an oblivious lookup table and show the existence of such a primitive. To this end, we describe a concrete construction, discuss its security ...

متن کامل

Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

متن کامل

From Model-Based Parameterizations to Lookup Tables: An EOF Approach

The goal of this study is to transform the Harrington radiation parameterization into a transfer scheme or lookup table, which provides essentially the same output (heating rate profile and shortand longwave fluxes at the surface) at a fraction of the computational cost. The methodology put forth here does not introduce a new parameterization simply derived from the Harrington scheme but, rathe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12122725